Load Balancing in Control Allocation

نویسندگان

  • Marc Bodson
  • Susan A. Frost
چکیده

Next-generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the actuator deflections. This paper discusses the alternative choice of the l1 norm, or the sup norm. Minimization of the control effort translates into the minimization of the maximum actuator deflection (min–max optimization). This paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are also investigated through examples. In particular, the min–max criterion results in a type of loadbalancing,where the load is the desired commandand the algorithmbalances this load among various actuators. The solution using the l1 norm also results in better robustness to failures and lower sensitivity to nonlinearities in illustrative examples. This paper also discusses the extension of the results to a normalized l1 norm, where the norm of the actuator deflections are scaled by the actuator limits. Minimization of the control effort then translates into the minimization of the maximum actuator deflection as a percentage of its range of motion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Simple Algorithms for Dynamic Load Balancing

This paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which...

متن کامل

A Control-based Load Balancing Algorithm with Flow Control for Dynamic and Heterogeneous Servers

Although load balancing is a fundamental and well-studied problem in resource allocation, the ever changing scenarios and technologies in distributed systems demand new approaches and algorithms. In this context, we consider a real world scenario where servers are heterogeneous and have dynamic background loads not controlled by the load balancer. In such scenarios, classic round robin policy o...

متن کامل

Analysis of Simple Algorithms for Dynamic Load Balancing

The principle of load balancing is examined for dynamic resource allocation subject to certain constraints The emphasis is on the performance of simple allocation strategies which can be implemented on line Either nite capacity constraints on resources or migration of load can be incorporated into the setup The load balancing problem is formulated as a stochastic optimal control problem Variant...

متن کامل

Execution Analysis of Load Balancing Algorithms in Cloud Computing Environment

The concept oft Cloud computing has significantly changed the field of parallel and distributed computing systems today. Cloud computing enables a wide range of users to access distributed, scalable, virtualized hardware and/or software infrastructure over the Internet. Load balancing is a methodology to distribute workload across multiple computers, or other resources over the network links to...

متن کامل

Multicast Routing and Spectrum Allocation Algorithm Based on QOS Constraints Load Balancing in Wireless Network

To deal with the issues like existing generation of congestion nodes and redundancy transmission in the traditional load balancing algorithm, this paper puts forward the load balance multicast routing and spectrum allocation algorithm based on QOS constraints. The algorithm adopts LBWC algorithm to calculate the wireless link weight, and carries out the structure of the load balancing multicast...

متن کامل

Cycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks

Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011